Shareability network based decomposition approach for solving large-scale single school routing problems

We consider the Single School Routing Problem (SSRP) where students from a single school are picked up by fleet of buses, subject to set constraints. The constraints that typically imposed for buses bus capacity, maximum student walking distance pickup point, and commute time each student. This is special case Vehicle (VRP) with common destination. propose decomposition approach solving this problem based on existing notion shareability network, which has been used recently in context dynamic ridepooling problems. Moreover, we come simplified formulation SSRP introducing connection between weighted covering (WSCP). To scale method large-scale instances, i) node compression network approach, ii) heuristic-based edge pruning techniques perform well practice. show compressed leads an Integer Linear Program (ILP) reduced dimensionality can be solved efficiently using off-the-shelf ILP solvers. Numerical experiments synthetic Boston Public (BPS) instances conducted evaluate performance our approach. Meanwhile, proposed allows natural extension alternate transportation modes students, effectively reduces number needed 15\% cost reduction average. two state-of-art compared approaches benchmark networks methods outperform both under setting.